Ancestors, descendants, and gardens of Eden in reaction systems

نویسندگان

  • Alberto Dennunzio
  • Enrico Formenti
  • Luca Manzoni
  • Antonio E. Porreca
چکیده

This paper analyses several problems related to finding and counting ancestor and descendant states, as well as gardens of Eden (i.e., states without predecessors) in reaction systems. The focus is on the complexity of finding and counting preimages and ancestors that are minimal with respect to cardinality. It turns out that the problems concerning gardens of Eden seem to require the presence of a NP-oracle to be solved. All the problems studied are intractable, with a complexity that ranges form FPNP[log n] to FPSPACE(poly).

متن کامل
منابع مشابه

The Enumeration of Preimages and Gardens-of-Eden in Sequential Cellular Automata

Cellular automata (CA) are discrete dynamic systems, of simple construction but varied behavior. Studying preimages of CA is important for learning their properties [2, 3]. Gardens-of-Eden (GOE) are sequences with no preimages and are related to the preimages of a rule in [1, 2, 4]. Recently in [5], Chris Barrett, William Y. C. Chen, and Christian Reidys made an approach on the GOE in sequentia...

متن کامل

Counting Fixed Points and Gardens of Eden of Sequential Dynamical Systems on Planar Bipartite Graphs

We study counting various types of configurations in certain classes of graph automata viewed as discrete dynamical systems. The graph automata models of our interest are Sequential and Synchronous Dynamical Systems (SDSs and SyDSs, respectively). These models have been proposed as a mathematical foundation for a theory of large-scale simulations of complex multi-agent systems. Our emphasis in ...

متن کامل

On the Complexity of Counting Fixed Points and Gardens of Eden in Sequential Dynamical Systems on Planar Bipartite Graphs

We study counting various types of configurations in certain classes of graph automata viewed as discrete dynamical systems. The graph automata models of our interest are Sequential and Synchronous Dynamical Systems (SDSs and SyDSs, respectively). These models have been proposed as the mathematical foundation for a theory of large-scale simulations of complex multi-agent systems. Our emphasis i...

متن کامل

Crops gone wild: evolution of weeds and invasives from domesticated ancestors

The evolution of problematic plants, both weeds and invasives, is a topic of increasing interest. Plants that have evolved from domesticated ancestors have certain advantages for study. Because of their economic importance, domesticated plants are generally well-characterized and readily available for ecogenetic comparison with their wild descendants. Thus, the evolutionary history of crop desc...

متن کامل

Amenability of groups is characterized by Myhill's Theorem

We prove a converse to Myhill’s “Garden-of-Eden” theorem and obtain in this manner a characterization of amenability in terms of cellular automata: A group G is amenable if and only if every cellular automaton with carrier G that has gardens of Eden also has mutually erasable patterns. This answers a question by Schupp, and solves a conjecture by CeccheriniSilberstein, Mach̀ı and Scarabotti.

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 608  شماره 

صفحات  -

تاریخ انتشار 2015